Ordered optimal solutions and parametric minimum cut problems
نویسندگان
چکیده
منابع مشابه
Solving Project Scheduling Problems by Minimum Cut Computations Solving Project Scheduling Problems by Minimum Cut Computations †
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable pr...
متن کاملSolving Large MAX CUT Problems Using Cross Entropy & Parametric Minimum Cross Entropy
Two stochastic optimization methods: Cross Entropy (CE) and Parametric Minimum Cross Entropy (PME) were tested against Large Max-Cut problems. The problems were taken from the "The DIMACS Library of Mixed Semidefinite-Quadratic-Linear Programs" challenge web site. The two methods achieved close and even better results than the Best Known Solution. In addition to results presentation, several im...
متن کاملOn DDoS Attack Related Minimum Cut Problems
In this paper, we study two important extensions of the classical minimum cut problem, called Connectivity Preserving Minimum Cut (CPMC) problem and Threshold Minimum Cut (TMC) problem, which have important applications in largescale DDoS attacks. In CPMC problem, a minimum cut is sought to separate a of source from a destination node and meanwhile preserve the connectivity between the source a...
متن کاملPontryagin's Minimum Principle for Fuzzy Optimal Control Problems
The objective of this article is to derive the necessary optimality conditions, known as Pontryagin's minimum principle, for fuzzy optimal control problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its $alpha$-level sets.
متن کاملSome Complexity Results for k-Cardinality Minimum Cut Problems
Many polynomially solvable combinatorial optimization problems (COP) become NP hard when we require solutions to satisfy an additional cardinality constraint. This family of problems has been considered only recently. We study a new problem of this family: the k-cardinality minimum cut problem. Given an undirected edge-weighted graph the k-cardinality minimum cut problem is to nd a partition of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2005
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2005.03.002